Abstract: Ad Hoc wireless network has the flexible, fast installment without the impact of cable networks, and has broad prospects for development. With the development of wireless communications technology, multicast applications widespread increasingly, multicast technology is becoming an important research topic. This paper studies the multicast routing problem in Ad Hoc network. For the complexity of existing algorithms and the difficulty of applying to the real world, the paper presents an efficient and effective multicast routing algorithm DCMR. First, the algorithm finds enough the delay constraint satisfied paths. Then, the path would be sorted by cost, and be selected in turn to cover all the receiving node, until the multicast tree is established. Finally, the validity of the multicast tree would be checked, removing the routing loop which may exist. Simulation results show that the tree costs generated by DCMR algorithm is slightly worse than KPP algorithm. But, for algorithm execution time, compared with KPP, DCMR has decreased 43.9%.

Key words: Ad Hoc, multicast, routing tree, cost optimization, delay constraint